Quantum complexity theory

Results: 258



#Item
21c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. 
 DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation

c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2006-01-18 09:22:02
22Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡  Martin J. Straussk

Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2006-09-25 10:55:42
23Recent Interactions between TCS and Quantum Physics Scott Aaronson September 2013 In 1994, when Peter Shor announced his famous algorithm for factoring integers in polynomial time using a quantum computer, it wasn’t ob

Recent Interactions between TCS and Quantum Physics Scott Aaronson September 2013 In 1994, when Peter Shor announced his famous algorithm for factoring integers in polynomial time using a quantum computer, it wasn’t ob

Add to Reading List

Source URL: thmatters.files.wordpress.com

Language: English - Date: 2015-10-14 11:22:07
24CEOC Centro de Estudos em Optimização e Controlo (Centre for Research in Optimization and Control) Computability and Algorithms

CEOC Centro de Estudos em Optimização e Controlo (Centre for Research in Optimization and Control) Computability and Algorithms

Add to Reading List

Source URL: ceoc.mat.ua.pt

Language: English - Date: 2008-07-17 10:24:20
252015 IEEE Symposium on Security and Privacy  Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs Eli Ben-Sasson§ , Alessandro Chiesa∗ , Matthew Green† , Eran Tromer¶ , Madars Virza‡ ∗ ETH

2015 IEEE Symposium on Security and Privacy Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs Eli Ben-Sasson§ , Alessandro Chiesa∗ , Matthew Green† , Eran Tromer¶ , Madars Virza‡ ∗ ETH

Add to Reading List

Source URL: diyhpl.us

Language: English
26

PDF Document

Add to Reading List

Source URL: www.cs.dartmouth.edu

Language: English - Date: 2014-03-05 21:08:38
27Efficient Set Intersection with Simulation-Based Security Michael J. Freedman∗ Carmit Hazay†  Kobbi Nissim‡

Efficient Set Intersection with Simulation-Based Security Michael J. Freedman∗ Carmit Hazay† Kobbi Nissim‡

Add to Reading List

Source URL: www.eng.biu.ac.il

Language: English - Date: 2014-09-04 05:09:56
28Microsoft Word - Folman - activity abstract.doc

Microsoft Word - Folman - activity abstract.doc

Add to Reading List

Source URL: www.bgu.ac.il

Language: English - Date: 2012-01-24 02:18:10
29WORKSHOP MISSION Quantum mechanics promises extraordinary capabilities for computation and cryptography. However, as classical beings, we cannot directly verify quantum states or quantum operations. How can we trust the

WORKSHOP MISSION Quantum mechanics promises extraordinary capabilities for computation and cryptography. However, as classical beings, we cannot directly verify quantum states or quantum operations. How can we trust the

Add to Reading List

Source URL: web.eecs.umich.edu

Language: English - Date: 2015-05-28 17:00:40
30Seminar on Sublinear Time Algorithms  Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-05-17 00:53:00